Eplex: Harnessing Mathematical Programming Solvers for Constraint Logic Programming
نویسندگان
چکیده
The eplex library of the ECLPS Constraint Logic Programming platform allows the integration of Mathematical Programming techniques with its native Constraint Logic Programming techniques within the same unified framework. It provides an interface to state-of-the-art Mathematical Programming solvers, and a set of programming primitives that allow ‘hybrid’ techniques to be easily expressed. This paper presents these facilities, and discusses some associated implementation issues.
منابع مشابه
Semantics for using Stochastic Constraint Solvers in Constraint Logic Programming
This paper proposes a number of models for integrating finitedomain stochastic constraint solvers into constraint logic programming systems to solve constraint-satisfaction problems efficiently. Stochastic solvers can solve hard constraint-satisfaction problems very efficiently, and constraint logic programming allows heuristics and problem breakdown to be encoded in the same language as the co...
متن کاملModels for Using Stochastic Constraint Solvers in Constraint Logic Programming
This paper proposes a number of models for integrating stochastic constraint solvers into constraint logic programming systems in order to solve constraint satisfaction problems eeciently. Stochastic solvers can solve hard constraint satisfaction problems very eeciently, and constraint logic programming allows heuristics and problem breakdown to be encoded in the same language as the constraint...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملUsing Stochastic Solvers in Constraint Logic Programming
This paper proposes a general framework for integrating a constraint logic programming system with a stochastic constraint solver to solve constraint satisfaction problems eeciently. Stochastic solvers can solve hard constraint satisfaction problems very eeciently, and constraint logic programming allows heuristics and problem breakdown to be encoded in the same language as the constraints. Hen...
متن کاملIntegrating Stochastic Solvers with Constraint Logic Programming
This paper proposes a general framework for integrating a constraint logic programming system with a stochastic constraint solver to solve constraint satisfaction problems eeciently. Stochas-tic solvers can solve hard constraint satisfaction problems very eeciently, and constraint logic programming allows heuristics and problem breakdown to be encoded in the same language as the constraints. He...
متن کامل